#include <bits/stdc++.h>
using namespace std;

bool is_Prime(const unsigned long long n) {
    if (n <= 1)
        return false;
    for (int i = 2; i <= sqrt(n); i++)
        if (n % i == 0)
            return false;
    return true;
}

int main() {
    unsigned long long n;
    cin >> n;
    cout << (is_Prime(n) ? "TRUE" : "FALSE") << endl;
    return 0;
}